Approximate substitutions and the normal ordering problem
نویسندگان
چکیده
In this paper, we show that the infinite generalised Stirling matrices associated with boson strings with one annihilation operator are projective limits of approximate substitutions, the latter being characterised by a finite set of algebraic equations. 1. Introduction The series of papers [1, 2, 3] had two sequels. First one, algebraic, was the construction of a Hopf algebra of Feynman-Bender diagrams [10, 11] arising from the product formula applied to two exponentials. Second one was the construction and description of one parameter groups of infinite matrices [4, 9] and their link with the combinatorics of so called Sheffer polynomials. The object of this paper is to continue the investigation of those one-parameter groups by highlighting the structure of the group of substitutions. It is shown here how we can see this group as a projective limit of what will be called approximate substitution groups. First, we consider Boson creation and annihilation operators with the commutation relation
منابع مشابه
Optimality conditions for approximate solutions of vector optimization problems with variable ordering structures
We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces. Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems. Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...
متن کاملBoson Normal Ordering via Substitutions and Sheffer-type Polynomials
We solve the boson normal ordering problem for (q(a)a + v(a)) with arbitrary functions q and v and integer n, where a and a are boson annihilation and creation operators, satisfying [a, a] = 1. This leads to exponential operators generalizing the shift operator and we show that their action can be expressed in terms of substitutions. Our solution is naturally related through the coherent state ...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملResource Constrained Project Scheduling with Material Ordering: Two Hybridized Meta-Heuristic Approaches (TECHNICAL NOTE)
Resource constrained project scheduling problem (RCPSP) is mainly investigated with the objective of either minimizing project makespan or maximizing project net present value. However, when material planning plays a key role in a project, the existing models cannot help determining material ordering plans to minimize material costs. In this paper, the RCPSP incorporated with the material order...
متن کاملAn Integrated Model of Project Scheduling and Material Ordering: A Hybrid Simulated Annealing and Genetic Algorithm
This study aims to deal with a more realistic combined problem of project scheduling and material ordering. The goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. The problem is first mathematically modelled. Then a hybrid simulated annealing and genetic algorithm is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0802.1162 شماره
صفحات -
تاریخ انتشار 2008